On Achieving the “Best of Both Worlds” in Secure Multiparty Computation
نویسندگان
چکیده
منابع مشابه
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation, where parties give their inputs to a trusted party which returns the output of the functionality to all parties. In particular, in the ideal model such computation is fair – all parties get the output. Cleve (STOC 1986) proved that, in general, fairness is not...
متن کاملSecure Multiparty Computation
A function is private if there exists a protocol that is secure; that is, no party can learn any additional information about the other parties’ inputs other than what follows from their own input and the function’s output. Previous studies have investigated multiparty computation with broadcast communication, but broadcast communication does not fully capture all secure multiparty protocols. W...
متن کاملSecure Multiparty Computation
Assume a number of parties want to compute a public function F (x1, . . . , xn) = (y1, . . . , yn). All of them want to get the correct answer, but none of them are willing to expose their secret inputs to other parties. One way to achieve this requirement is to implement the secure multiparty computation protocols. In this paper, we will make a brief introduction to secure multiparty computati...
متن کاملScalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settings even vanishes, with the number of players. Our protocol is secure against an active adversary which may adaptively corrupt up to some constant fraction of the players. The protocol can be implemented in a constant ...
متن کاملThe Best of Both Worlds
Open networks give actors non-redundant information that is diverse, while closed networks offer redundant information that is easier to interpret. Integrating arguments about network structure and the similarity of actors' knowledge, we propose two types of network configurations that combine diversity and ease of interpretation. Closed-diverse networks offer diversity in actors' knowledge dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2011
ISSN: 0097-5397,1095-7111
DOI: 10.1137/100783224